Termination w.r.t. Q proof of /tmp/tmpPDbT5B/4.39.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

*(x, *(minus(y), y)) → *(minus(*(y, y)), x)

Q is empty.

↳ QTRS

  ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

*(x, *(minus(y), y)) → *(minus(*(y, y)), x)

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

*(x, *(minus(y), y)) → *(minus(*(y, y)), x)

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

*(x, *(minus(y), y)) → *(minus(*(y, y)), x)

Used ordering:
Polynomial interpretation [25]:

POL(*(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(minus(x₁)) = 1 + x₁

↳ QTRS

  ↳ RRRPoloQTRSProof

    ↳ QTRS

      ↳ RisEmptyProof

Q restricted rewrite system:
R is empty.
Q is empty.

The TRS R is empty. Hence, termination is trivially proven.